Elementary Moves on Polygonal Triangulations of the Disk

نویسنده

  • ANDY EISENBERG
چکیده

Definition 3 (Polygonal Triangulation). Let K be a two-dimensional simplicial complex (i.e., a collection of triangles). If K is homeomorphic to a disk, then it is called a triangulation of a disk. Furthermore, if K is a k-gon divided by diagonals into k − 2 triangles, then K will be called a polygonal triangulation. See Figure 1. A k-gon dissected into k − 2 triangles will be called a k-triangulation for the purposes of this paper. Note that a k-triangulation has k−3 diagonals. The vertices of a triangulation K will be enumerated v1, . . . , vk, moving clockwise around the outside of the k-gon.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

All triangulations are reachable via sequences of edge-flips: an elementary proof

A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.

متن کامل

Elementary Moves on Triangulations

It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an additive function (valuation) defined only on simplices may always be extended to an additive function on all polyhedra. 2000 AMS subject classification: 52B45; 52A38; 57Q15;

متن کامل

Triangulations of Surfaces

This paper uses an elementary surgery technique to give a simple topological proof of a theorem of Harer which says that the simplicial complex having as its top-dimensional simplices the isotopy classes of triangulations of a compact surface with a fixed set of vertices is contractible, except in a few special cases when it is homeomorphic to a sphere. (Triangulations here are allowed to have ...

متن کامل

On Compatible Triangulations with a Minimum Number of Steiner Points

Two vertex-labelled polygons are compatible if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations—for every face, the clockwise cyclic order of vertices on the boundary must be the same. It is known that every pair of compatible n-vertex polygonal regions can be extended to compatible triangulations b...

متن کامل

The Number of Reidemeister Moves Needed for Unknotting

A knot is an embedding of a circle S in a 3-manifold M , usually taken to be R or S. In the 1920’s Alexander and Briggs [2, §4] and Reidemeister [23] observed that questions about ambient isotopy of polygonal knots in R can be reduced to combinatorial questions about knot diagrams. These are labeled planar graphs with overcrossings and undercrossings marked, representing a projection of the kno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006